Varieties of comma-free codes
نویسندگان
چکیده
New varieties of comma-free codes CFC of length 3 on the 4-letter alphabet are defined and analysed: self-complementary comma-free codes (CCFC), C3 comma-free codes (C3CFC), C3 self-complementary comma-free codes (C3CCFC), selfcomplementary maximal comma-free codes (CMCFC), C3 maximal comma-free codes (C3MCFC) and C3 self-complementary maximal comma-free codes (C3CMCFC). New properties with words of length 3, 4, 5 and 6 in comma-free codes are used for the determination of growth functions in the studied code varieties. c © 2007 Elsevier Ltd. All rights reserved.
منابع مشابه
A relation between trinucleotide comma-free codes and trinucleotide circular codes
The comma-free codes and circular codes are two important classes of codes in code theory and in genetics. Fifty years ago before the discovery of the genetic code, a trinucleotide (triletter) comma-free code was proposed for associating the codons of genes with the amino acids of proteins. More recently, in the last ten years, trinucleotide circular codes have been identified statistically in ...
متن کاملRestrictions and Generalizations on Comma-Free Codes
A significant sector of coding theory is that of comma-free coding; that is, codes which can be received without the need of a letter used for word separation. The major difficulty is in finding bounds on the maximum number of comma-free words which can inhabit a dictionary. We introduce a new class called a self-reflective comma-free dictionary and prove a series of bounds on the size of such ...
متن کاملFinite State Models in the Study of Comma-Free Codes
The definition of comma-free codes is extended to be more comprehensive and include codes with variable length codewords and codes with an unlimited number of codewords. Finite state recognizers are used to represent commafree codes in a compact form, making available the well established methods of manipulating and analysing finite state models. An efficient algorithm is presented to test the ...
متن کاملCOMPLETING COMMA-FREE CODES by
We prove that for every regular comma-free code there exists a maximal comma-free code containing it which is still regular and, moreover, we can effectively locate such a completion. In particular, we can decide whether a given regular comma-free code is maximal.
متن کاملInvolution Solid and Join Codes
In this paper we study a generalization of the classical notions of solid codes and comma-free codes: involution solid codes (θ-solid) and involution join codes (θ-join). These notions are motivated by DNA strand design where Watson-Crick complementarity can be formalized as an antimorphic involution. We investigate closure properties of these codes, as well as necessary conditions for θ-solid ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 55 شماره
صفحات -
تاریخ انتشار 2008